package main

import (
	"github.com/walkabc/algorithm"
	"log"
)

func main() {
	nums := []int{86, 14, 31, 72, 78, 27, 79, 24, 36, 8, 63, 19, 1, 92, 33, 83, 85, 64, 75, 9, 30, 23, 44, 16, 5, 65, 38, 98, 21, 11, 90, 20, 88, 25, 42, 66, 49, 12, 7, 48, 34, 32, 55, 2, 62, 37, 50, 54, 76, 93, 74, 29, 39, 57, 6, 87, 47, 45, 61, 80, 84, 82, 97, 96, 77, 67, 51, 17, 73, 99, 28, 3, 71, 4, 52, 68, 46, 91, 13, 35, 81, 58, 59, 94, 18, 22, 56, 100, 53, 41, 89, 15, 60, 10, 40, 69, 95, 26, 43, 0}
	//nums := []int{56, 90, 95, 82}
	//algorithm.QuickSort(nums)
	vs := algorithm.MergeSort(nums)
	log.Println(vs)
}
